/*
*	ID : pallab81
* 	PROG : 11481
* 	LANG : C++
* 	2012-06-16-13.28.59 Saturday
*
* 	"I have not failed, I have just found 10000 ways that won't work.
*/

#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;


#define foR(i1,st,ed) for(int i1 = st , j1 = ed ; i1 < j1 ; ++i1 )
#define fo(i1,ed) foR( i1 , 0 , ed )
#define foE(i1,st,ed) foR( i1, st, ed+1 )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define line puts("")

template<class T1>
inline void debug(T1 _x) {
    cout<<_x<<'\n';
}
template<class T1, class T2>
inline void debug(T1 _x,T2 _y) {
    cout<<_x<<' '<<_y<<'\n';
}
template<class T1, class T2, class T3>
inline void debug(T1 _x,T2 _y,T3 _z) {
    cout<<_x<<' '<<_y<<' '<<_z<<'\n';
}
template<class T1, class T2, class T3, class T4>
inline void debug(T1 _x,T2 _y,T3 _z,T4 _zz) {
    cout<<_x<<' '<<_y<<' '<<_z<<' '<<_zz<<'\n';
}
template< class T1>
inline void debug(T1 _array,int _size) {
    cout<<"[";
    for (int i=0; i<_size; ++i) {
        cout<<' '<<_array[i];
    }
    puts(" ]");
}
inline bool CI(int &_x) {
    return scanf("%d",&_x)==1;
}
inline bool CI(int &_x, int &_y) {
    return CI(_x)&&CI(_y) ;
}
inline bool CI(int &_x, int &_y, int &_z) {
    return CI(_x)&&CI(_y)&&CI(_z) ;
}
inline bool CI(int &_x, int &_y, int &_z, int &_zz) {
    return CI(_x)&&CI(_y)&&CI(_z)&&CI(_zz) ;
}
inline void wait( double seconds ){
    double endtime = clock()+( seconds* CLOCKS_PER_SEC );
    while( clock() < endtime ){
        ;
    }
}
inline Int domod(Int var){
    Int ret = var%1000000007LL;
    while(ret<0)ret+=1000000007LL;

    return ret;
}
namespace Precompute{
    Int ncr[1005][1005];
    inline void NcR(){
        for(int i=0;i<=1000;++i){
                ncr[i][0]=1;
        }
        for(int i=1;i<=1000;++i){
                for(int j=1;j<=i;++j){
                    ncr[i][j] = domod( ncr[i-1][j-1]+ncr[i-1][j] );
                }
        }
    }
    Int npr[1005][1005];
    inline void NpR(){
        npr[0][0]=1;
        for(int i=1;i<=1000;++i){
            npr[i][0]=domod(npr[i-1][0]*i);
        }
        for(int i=1;i<=1000;++i){
            for(int j=1;j<=i;++j){
                npr[i][j]=domod(npr[i][j-1]-npr[i-1][j-1]);
            }
        }
    }
}
inline void Solve(){
    int N,M,K;
    CI(N,M,K);
    cout<< domod( Precompute::ncr[M][K]*Precompute::npr[N-K][M-K]);line;
}
#define FILE
#define showCase
int main(){
    Precompute::NcR();
    Precompute::NpR();

	#ifdef FILE
	freopen("/home/xerxes/Documents/11481/in","rt",stdin);
	#endif
	int tt;
	CI(tt);
	foE(i,1,tt){
		#ifdef showCase
	        cout<<"Case "<<i<<": ";
		#endif
		Solve();
	}


return 0;
}
